/**
 * Software License, Version 1.0
 * 
 * Copyright 2003 The Trustees of Indiana University.  All rights reserved.
 * 
 *
 *Redistribution and use in source and binary forms, with or without 
 *modification, are permitted provided that the following conditions are met:
 *
 *1) All redistributions of source code must retain the above copyright notice,
 * the list of authors in the original source code, this list of conditions and
 * the disclaimer listed in this license;
 *2) All redistributions in binary form must reproduce the above copyright 
 * notice, this list of conditions and the disclaimer listed in this license in
 * the documentation and/or other materials provided with the distribution;
 *3) Any documentation included with all redistributions must include the 
 * following acknowledgement:
 *
 *"This product includes software developed by the Community Grids Lab. For 
 * further information contact the Community Grids Lab at 
 * http://communitygrids.iu.edu/."
 *
 * Alternatively, this acknowledgement may appear in the software itself, and 
 * wherever such third-party acknowledgments normally appear.
 * 
 *4) The name Indiana University or Community Grids Lab or NaradaBrokering, 
 * shall not be used to endorse or promote products derived from this software 
 * without prior written permission from Indiana University.  For written 
 * permission, please contact the Advanced Research and Technology Institute 
 * ("ARTI") at 351 West 10th Street, Indianapolis, Indiana 46202.
 *5) Products derived from this software may not be called NaradaBrokering, 
 * nor may Indiana University or Community Grids Lab or NaradaBrokering appear
 * in their name, without prior written permission of ARTI.
 * 
 *
 * Indiana University provides no reassurances that the source code provided 
 * does not infringe the patent or any other intellectual property rights of 
 * any other entity.  Indiana University disclaims any liability to any 
 * recipient for claims brought by any other entity based on infringement of 
 * intellectual property rights or otherwise.  
 *
 *LICENSEE UNDERSTANDS THAT SOFTWARE IS PROVIDED "AS IS" FOR WHICH NO 
 *WARRANTIES AS TO CAPABILITIES OR ACCURACY ARE MADE. INDIANA UNIVERSITY GIVES
 *NO WARRANTIES AND MAKES NO REPRESENTATION THAT SOFTWARE IS FREE OF 
 *INFRINGEMENT OF THIRD PARTY PATENT, COPYRIGHT, OR OTHER PROPRIETARY RIGHTS. 
 *INDIANA UNIVERSITY MAKES NO WARRANTIES THAT SOFTWARE IS FREE FROM "BUGS", 
 *"VIRUSES", "TROJAN HORSES", "TRAP DOORS", "WORMS", OR OTHER HARMFUL CODE.  
 *LICENSEE ASSUMES THE ENTIRE RISK AS TO THE PERFORMANCE OF SOFTWARE AND/OR 
 *ASSOCIATED MATERIALS, AND TO THE PERFORMANCE AND VALIDITY OF INFORMATION 
 *GENERATED USING SOFTWARE.
 */

package cgl.narada.performance;

/**
 * <p>Title: </p>
 * <p>Description: </p>
 * @author Gurhan Gunduz
 * @version 1.0
 */

import java.util.Enumeration;
import java.util.Hashtable;

import cgl.narada.transport.Link;
import cgl.narada.transport.MonitoredLink;
import cgl.narada.transport.TransportException;
import cgl.narada.transport.TransportHandlerImpl;
import cgl.narada.transport.multicast.MulticastLink;

public class MonitoringDataEvaluator {
  private TransportHandlerImpl t_handler;
  private String modulaName="MonitoringDataEvaluator: ";
  public MonitoringDataEvaluator(TransportHandlerImpl th) {
    t_handler=th;
  }

  public boolean isPerformanceData(byte[] data){
    int transportHeader = (int) data[0];
    if (transportHeader == cgl.narada.protocol.Protocol.PERFORMANCE_MEASUREMENT) {
      return true;
    }
    return false;
  }

  public void checkLinkType(byte[] data, String linkId, Hashtable links){
    String type=linkId.substring(0,3);
    if (type.equalsIgnoreCase("mul")){
    }else
      processPerformanceMessage(data, linkId, links);

  }//end checkLinkType


  public void processMulticastMessage(byte[] data, String linkId, Hashtable links){
      Enumeration e = links.elements();
      while (e.hasMoreElements()) {
        Link link = (Link) e.nextElement();
        if (link.getLinkId().equals(linkId)) {
          MulticastLink l = (MulticastLink) link;
          l.setPerformanceGathering(false);
        }
      }
  }

  public void processPerformanceMessage(byte[] data, String linkId, Hashtable links){
    byte[] dataRecv = new byte[data.length];
    System.arraycopy(data, 0, dataRecv, 0, data.length);
    int protocolHeader =  (int) dataRecv[0];
    if (protocolHeader ==
        cgl.narada.protocol.Protocol.PERFORMANCE_MEASUREMENT) {
      if (dataRecv[1] == MeasurementConstants.REQUEST) {
        /** Echo the data right back to the initiator */
        dataRecv[1] = MeasurementConstants.RESPONSE;
        try {
          t_handler.sendData(dataRecv, linkId);
        }
        catch (TransportException ex) {
        }
        return;
      }
      if (dataRecv[1] == MeasurementConstants.RESPONSE) {
        long stopTime = System.currentTimeMillis();
        MonitoredLink _link = null;
        if (links.containsKey(linkId)) {
          _link = (MonitoredLink) links.get(linkId);
          _link.processPerformancePackets(dataRecv);
        }
        if (_link == null) {
          Enumeration e = links.elements();
          while (e.hasMoreElements()) {
            Link link = (Link) e.nextElement();
            if (link.getLinkId().equals(linkId)) {
              MonitoredLink l = (MonitoredLink) link;
              l.processPerformancePackets(dataRecv);
            }
          }
        }

      }
    }
    /** end handling performance measurement */

  }//end process performance message







}
